Fast, silent self-stabilizing distance-k independent dominating set construction

We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size; it requires (k + 1)log(n + 1) bits per node. keywords: distributed computing, fault tolerance, self-stabilization, distance-k independent dominating set, distance-k dominating set, distance-k independent set